A SHORT NOTE ON AN ADVANCE IN ESTIMATING THE WORST-CASE PERFORMANCE RATIO OF THE MPS ALGORITHMPALETTA, Giuseppe; VOCATURO, Francesca.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2198-2203, issn 0895-4801, 6 p.Article

ON MAXIMIZING WELFARE WHEN UTILITY FUNCTIONS ARE SUBADDITIVEFEIGE, Uriel.SIAM journal on computing (Print). 2009, Vol 39, Num 1, pp 122-142, issn 0097-5397, 21 p.Article

A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR OPTIMAL 1.5D TERRAIN GUARDINGBEN-MOSHE, Boaz; KATZ, Matthew J; MITCHELL, Joseph S. B et al.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1631-1647, issn 0097-5397, 17 p.Article

AN APPROXIMATION ALGORITHM FOR MAX-MIN FAIR ALLOCATION OF INDIVISIBLE GOODSASADPOUR, Arash; SABERI, Amin.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2970-2989, issn 0097-5397, 20 p.Article

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation: Formalisme unifié et classes d'approximation = About new notions for approximation algorithm analysis: unified formalism and approximation classesDEMANGE, Marc; PASCHOS, E. T.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 3, pp 237-277, issn 0399-0559, 41 p.Article

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation: De la structure de NPO à la structure des instances = About new notions for the approximation algorithm analysis: from thoe NPO structure to the instance structureDEMANGE, Marc; PASCHOS, Vangelis.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 4, pp 311-350, issn 0399-0559, 40 p.Article

ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIMECZUMAJ, Artur; SOHLER, Christian.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 904-922, issn 0097-5397, 19 p.Article

APPROXIMATION ALGORITHMS FOR SCHEDULING PARALLEL JOBSJANSEN, Klaus; THOLE, Ralf.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3571-3615, issn 0097-5397, 45 p.Article

A NOTE ON DUAL APPROXIMATION ALGORITHMS FOR CLASS CONSTRAINED BIN PACKING PROBLEMSXAVIER, Eduardo C; KEIDI MIYAZAWA, Flavio.Informatique théorique et applications (Imprimé). 2009, Vol 43, Num 2, pp 239-248, issn 0988-3754, 10 p.Article

A 3/2-APPROXIMATION ALGORITHM FOR SCHEDULING INDEPENDENT MONOTONIC MALLEABLE TASKSMOUNIE, Gregory; RAPINE, Christophe; TRYSTRAM, Denis et al.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 401-412, issn 0097-5397, 12 p.Article

PHENOTYPE SPACE AND KINSHIP ASSIGNMENT FOR THE SIMPSON INDEXLITOW, Bruce; KONOVALOV, Dmitry.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 2, pp 323-333, issn 0988-3754, 11 p.Article

A one-dimensional bin packing problem with shelf divisionsXAVIER, E. C; MIYAZAWA, F. K.Discrete applied mathematics. 2008, Vol 156, Num 7, pp 1083-1096, issn 0166-218X, 14 p.Article

TESTING SYMMETRIC PROPERTIES OF DISTRIBUTIONS : Forfieth Annual ACM Symposium on Theory of omputing (STOC 2008)VALIANT, Paul.SIAM journal on computing (Print). 2011, Vol 40, Num 6, pp 1927-1968, issn 0097-5397, 42 p.Article

AN OPTIMAL BIFACTOR APPROXIMATION ALGORITHM FOR THE METRIC UNCAPACITATED FACILITY LOCATION PROBLEMBYRKA, Jaroslaw; AARDAL, Karen.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2212-2231, issn 0097-5397, 20 p.Article

EFFECTIVE COMPUTATIONS ON SLIDING WINDOWSBRAVERMAN, Vladimir; OSTROVSKY, Rafail.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2113-2131, issn 0097-5397, 19 p.Article

A NEW APPROXIMATION ALGORITHM FOR THE NONPREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON IDENTICAL PARALLEL PROCESSORSPALETTA, Giuseppe; PIETRAMALA, Paolamaria.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 313-328, issn 0895-4801, 16 p.Article

APPROXIMATION ALGORITHMS FOR NONUNIFORM BUY-AT-BULK NETWORK DESIGNCHEKURI, C; HAJIAGHAYI, M. T; KORTSARZ, G et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1772-1798, issn 0097-5397, 27 p.Article

THE EUCLIDEAN ORIENTEERING PROBLEM REVISITEDKE CHEN; HAR-PELED, Sariel.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 385-397, issn 0097-5397, 13 p.Article

Improved combinatorial approximation algorithms for the k-level facility location problemAGEEV, Alexander; YINYU YE; JIAWEI ZHANG et al.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 1, pp 207-217, issn 0895-4801, 11 p.Article

APPROXIMATING STEINER NETWORKS WITH NODE-WEIGHTSNUTOV, Zeev.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3001-3022, issn 0097-5397, 22 p.Article

TOWARDS SHARP INAPPROXIMABILITY FOR ANY 2-CSP : Foundations of Computer ScienceAUSTRIN, Per.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2430-2463, issn 0097-5397, 34 p.Article

APPROXIMATION ALGORITHMS FOR MULTICOMMODITY FACILITY LOCATION PROBLEMSRAVI, R; SINHA, Amitabh.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 538-551, issn 0895-4801, 14 p.Article

APPROXIMATING THE UNWEIGHTED k-SET COVER PROBLEM: GREEDY MEETS LOCAL SEARCHLEVIN, Asaf.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 251-264, issn 0895-4801, 14 p.Article

COMBINATION CAN BE HARD: APPROXIMABILITY OF THE UNIQUE COVERAGE PROBLEMDEMAINE, Erik D; FEIGE, Uriel; HAJIAGHAYI, Mohammadtaghi et al.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1464-1483, issn 0097-5397, 20 p.Article

Approximation algorithms for rectangle stabbing and interval stabbing problemsKOVALEVA, Sofia; SPIEKSMA, Frits C. R.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 3, pp 748-768, issn 0895-4801, 21 p.Article